The k-Steiner ratio in the rectilinear planeBORCHERS, A; DU, D.-Z; BIAO GAO et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 1-17, issn 0196-6774Article

Algorithms for terminal steiner treesVIDUANI MARTINEZ, Fabio; COELHO DE PINA, José; SOARES, José et al.Lecture notes in computer science. 2005, pp 369-379, issn 0302-9743, isbn 3-540-28061-8, 11 p.Conference Paper

Approximating Steiner trees in graphs with restricted weightsHALLDORSSON, M. M; UENO, S; NAKAO, H et al.Networks (New York, NY). 1998, Vol 31, Num 4, pp 283-292, issn 0028-3045Article

The Gilbert Arborescence ProblemVOLZ, M. G; BRAZIL, M; RAS, C. J et al.Networks (New York, NY). 2013, Vol 61, Num 3, pp 238-247, issn 0028-3045, 10 p.Article

Construction of efficient communication sub-structures: Non-approximability results and polynomial sub-casesLAFOREST, Christian.Lecture notes in computer science. 2003, pp 903-910, issn 0302-9743, isbn 3-540-40788-X, 8 p.Conference Paper

The Existence Problem for Steiner Networks in Strictly Convex DomainsFREIRE, Alexandre.Archive for rational mechanics and analysis. 2011, Vol 200, Num 2, pp 361-404, issn 0003-9527, 44 p.Article

On the full and bottleneck full Steiner tree problemsYEN HUNG CHEN; CHIN LUNG LU; CHUAN YI TANG et al.Lecture notes in computer science. 2003, pp 122-129, issn 0302-9743, isbn 3-540-40534-8, 8 p.Conference Paper

On the approximability of the steiner tree problemTHIMM, Martin.Lecture notes in computer science. 2001, pp 678-689, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Vertex-distinguishing edge-colorings of 2-regular graphsWITTMANN, P.Discrete applied mathematics. 1997, Vol 79, Num 1-3, pp 265-277, issn 0166-218XArticle

Practical partitioning-based methods for the steiner problemPOLZIN, Tobias; VAHDATI DANESHMAND, Siavash.Lecture notes in computer science. 2006, pp 241-252, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 12 p.Conference Paper

Parallel Delaunay refinement with off-centersSPIELMAN, Daniel A; TENG, Shang-Hua; ÜNGÖR, Alper et al.Lecture notes in computer science. 2004, pp 812-819, issn 0302-9743, isbn 3-540-22924-8, 8 p.Conference Paper

A novel analog layout synthesys toolLIHONG ZHANG; KLEINE, Ulrich.IEEE International Symposium on Circuits and Systems. 2004, pp 101-104, isbn 0-7803-8251-X, 4 p.Conference Paper

Preprocessing steiner problems from VLSI layoutUCHOA, Eduardo; DE ARAGAO, Marcus Poggi; RIBEIRO, Celso C et al.Networks (New York, NY). 2002, Vol 40, Num 1, pp 38-50, issn 0028-3045Article

The Steiner number of a graphCHARTRAND, Gary; PING ZHANG.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 41-54, issn 0012-365XArticle

The Steiner tree problem for terminals on the boundary of a rectilinear polygonCHENG, S.-W.Theoretical computer science. 2000, Vol 237, Num 1-2, pp 213-238, issn 0304-3975Article

Interconnection strategies for wireless access networksYANIKOMEROGLU, H; SOUSA, E. S.IEEE international symposium on personal indoor and mobile radio communications. 1997, pp 882-886, 3VolConference Paper

Algorithms for terminal Steiner treesVIDUANI MARTINEZ, Fabio; COELHO DE PINA, José; SOARES, José et al.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 133-142, issn 0304-3975, 10 p.Article

Approximate hierarchical facility location and applications to the shallow steiner tree and range assignment problemsKANTOR, Erez; PELEG, David.Lecture notes in computer science. 2006, pp 211-222, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Efficient DNA sticker algorithms for NP-complete graph problemsZIMMERMANN, Karl-Heinz.Computer physics communications. 2002, Vol 144, Num 3, pp 297-309, issn 0010-4655, 13 p.Article

Extending reduction techniques for the Steiner tree problemPOLZIN, Tobias; SIAVASH VAHDATI DANESHMAND.Lecture notes in computer science. 2002, pp 795-807, issn 0302-9743, isbn 3-540-44180-8, 13 p.Conference Paper

Coloring mixed hypertreesKRAL, Daniel; KRATOCHVIL, Jan; PROSKUROWSKI, Andrzej et al.Lecture notes in computer science. 2000, pp 279-289, issn 0302-9743, isbn 3-540-41183-6Conference Paper

On computing and drawing Maxmin-height covering triangulationBINHAI ZHU; XIAOTIE DENG.Lecture notes in computer science. 1998, pp 464-466, issn 0302-9743, isbn 3-540-65473-9Conference Paper

Prize collecting Steiner trees with node degree dependent costsGOUVEIA, Luis; MOURA, Pedro; DE SOUSA, Amaro et al.Computers & operations research. 2011, Vol 38, Num 1, pp 234-245, issn 0305-0548, 12 p.Article

The number of tree stars is Ο* (1.357^k)FUCHS, Bernhard; KERN, Walter; XINHUI WANG et al.Algorithmica. 2007, Vol 49, Num 3, pp 232-244, issn 0178-4617, 13 p.Article

Reduction tests for the prize-collecting Steiner problemUCHOA, Eduardo.Operations research letters. 2006, Vol 34, Num 4, pp 437-444, issn 0167-6377, 8 p.Article